Projecting an Extended Formulation for Mixed-Integer Covers on Bipartite Graphs

نویسندگان

  • Michele Conforti
  • Laurence A. Wolsey
  • Giacomo Zambelli
چکیده

We consider the mixed integer version of bipartite vertex cover. This is equivalent to the mixed integer network dual model, recently introduced in [2], that generalizes several mixed integer sets arising in production planning. We derive properties of inequalities that are valid for the convex hull of the mixed integer bipartite covers by projecting an extended formulation onto the space of the original variables. This permits us to give a complete description of the facet inducing inequalities of the double mixing set and of the continuous mixing set with flows, two mixed integer sets that generalize several models studied in the literature.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mixed-Integer Vertex Covers on Bipartite Graphs

Let A be the edge-node incidence matrix of a bipartite graph G = (U, V ;E), I be a subset the nodes of G, and b be a vector such that 2b is integral. We consider the following mixed-integer set: X(G, b, I) = {x : Ax ≥ b, x ≥ 0, xi integer for all i ∈ I}. We characterize conv(X(G, b, I)) in its original space. That is, we describe a matrix (A′, b′) such that conv(X(G, b, I)) = {x : A′x ≥ b′}. Th...

متن کامل

Mixed cycle-E-super magic decomposition of complete bipartite graphs

An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ΣνεV(H) f(v) +  ΣeεE(H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥ ...

متن کامل

The distinguishing chromatic number of bipartite graphs of girth at least six

The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling   with $d$ labels  that is preserved only by a trivial automorphism. The distinguishing chromatic number $chi_{D}(G)$ of $G$ is defined similarly, where, in addition, $f$ is assumed to be a proper labeling. We prove that if $G$ is a bipartite graph of girth at least six with the maximum ...

متن کامل

Instructor : Nikhil Bansal Scribe : Tim Oosterwijk 1 Independent set problem for bipartite graphs

Last lecture, we started a discussion about the independent set (“stable set”) problem. For a given graph G = (V,E), an independent set is a subset of vertices that are mutually non-adjacent. The independent set problem asks to find the maximum cardinality of such a vertex set. We saw this problem is notoriously NP-hard: it is NP-hard to approximate within a factor n1−ε for any ε > 0. However, ...

متن کامل

A mixed integer linear programming formulation for a multi-stage, multi-Product, multi-vehicle aggregate production-distribution planning problem

In today’s competitive market place, companies seek an efficient structure of supply chain so as to provide customers with highest value and achieve competitive advantage. This requires a broader perspective than just the borders of an individual company during a supply chain. This paper investigates an aggregate production planning problem integrated with distribution issues in a supply chain ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Oper. Res.

دوره 35  شماره 

صفحات  -

تاریخ انتشار 2010